Detection of repetitive data signals

ABSTRACT

There is provided an apparatus for detecting repetitive information in data packets communicated between a first node and a second node over a wireless network. The apparatus includes a processing circuitry. The processing circuitry is configured to: (a) collect samples of a data communication signal transmitted between said first node and the second node over said wireless network at a plurality of respective times; (b) group the collected samples into a plurality of sequences of samples; (c) combine the sequences of samples into at least one united signal; and (d) based on an analysis of the at least one united signal, provide a signal indicative of repetitive information in a plurality of data packets carried by said data communication signal.

CROSS REFERENCE

This application claims priority from Israeli patent application 276678filing date 12 Aug. 2020 which is incorporated herein by reference.

FIELD AND BACKGROUND OF THE INVENTION

The present invention, in some embodiments thereof, relates to detectingrepetitive information in a data signal and, more specifically, but notexclusively, to detecting repetitive information in data packets.

In wireless data communications the ability to extract the data from areceived signal is highly dependent on the signal-to-noise ratio (SNR)of the received signal. Many factors may cause low SNR at the receiver,such as a large distance between the reception side and the transmissionside and/or high interference at the reception side. In low SNRconditions it may be impossible to extract the data (e.g. data packets)from the received signal.

In some cases, it is desired to detect portions of a data signal whichrepeat in multiple packets or even in all packets. An example of such arepetition is illustrated in FIG. 1 in which the same bit sequencerepeats at the same bit location in all of data packets 1-N.

For example, a source address and/or destination address may repeat inmultiple packets transferred between the same source and the samedestination. The source address and the destination address aretypically located in the same bit locations within the packet. When therate and coding modulation scheme are kept constant, the address symbolsare even kept in the same location within the packet signal. Forexample, in orthogonal frequency-division multiplexing (OFDM) the sourceand destination addresses are located in the same OFDM frame and on thesame OFDM subcarriers. Additional examples of repetitive signals are thepreamble and sync signals which are constant in multiple packets.

In conditions of high SNR the data packets are detectable in the signal,thus the time of arrival of each data packet is known. Based on therespective times of arrival of the received data packets and due to thehigh SNR of the received signal, the contents of the data packet (e.g.control information and data payload) may be determined, and comparedbetween multiple data packets to identify repetitive information inmultiple data packets. However this is not possible in cases of low SNRin which the times of arrival of the data packet receptions are unknownand/or it is impossible to determine the contents of the data packet.

SUMMARY OF THE INVENTION

It is an object of the present invention to provide an apparatus, asystem, a computer program product, and a method for detectinginformation which repeats in multiple data packets carried by a datacommunication signal.

When data communication signals are received under poor SNR conditions,it may be impossible to detect the data packets in the received signal.Furthermore, even if data packets may be detected it may be impossibleto extract the data from the data packet.

Embodiments of the invention combine samples of a data communicationsignal (denoted herein signal samples or samples) into one or moreunited signals, in a manner which enhances the SNR of information whichrepeats in multiple data packets (denoted herein repetitiveinformation). With better SNR, the contents of control fields and/ordata payload which repeat in multiple packets may be detected even underpoor channel conditions.

The signal samples are grouped into sequences (denoted herein samplesequences). For example, the signal samples may be grouped so that eachsignal sequence is expected to include a single data packet (when thesampling and grouping are properly synchronized to the actual datapacket reception times). The samples are combined into one or moreunited signals in a manner which improves the SNR of information whichrepeats in multiple data packets. In some embodiments, the data samplevalues are combined directly. In other embodiments, data packets aredetected in the sequences and the united signal(s) are created afterdata packet detection.

The united signal(s) are analyzed to detect if repetitive information isor is not present in the collected packets and/or to extract therepetitive information from the united signal.

Some embodiments of the invention are particularly beneficial when thereis limited information about the transmitted signal (e.g. cycle, codingand modulation scheme, etc.). The sampled data packets are combined indifferent ways to form multiple united signals which are analyzed(either separately or in combination) in order to determine whetherrepetitive information is present in at least one of them.Thus—different hypotheses regarding carrier frequencies, frequencyhopping cycles, data packet reception times, and so forth may beanalyzed until an effective combination of samples is achieved.

According to a first aspect of some embodiments of the presentinvention, there is provided an apparatus for detecting repetitiveinformation in data packets communicated between a first node and asecond node over a wireless network. The apparatus includes processingcircuitry, configured to:

collect samples of a data communication signal transmitted between thefirst node and the second node over the wireless network at multiplerespective times;

group the collected samples into multiple sequences of samples;

combine the sequences of samples into at least one united signal; and

based on an analysis of the at least one united signal, provide a signalindicative of repetitive information in multiple data packets carried bythe data communication signal.

According to some implementations of the first aspect of the invention,the apparatus further includes a sampler configured for sampling abaseband input signal and for providing the samples to the processingcircuitry for collection.

According to a second aspect of some embodiments of the presentinvention there is provided a method of detecting repetitive informationin data packets communicated between a first node and a second node overa wireless network. The method includes:

collecting samples of a data communication signal transmitted betweenthe first node and the second node over the wireless network at multiplerespective times;

grouping the collected samples into multiple sequences of samples;

combining the sequences of samples into at least one united signal; and

based on an analysis of the at least one united signal, providing asignal indicative of repetitive information in multiple data packetscarried by the data communication signal.

According to some implementations of the first aspect or second aspectof the invention, the analysis includes identifying a presence orabsence of repetitive information in the at least one united signal, andthe signal indicative of repetitive information includes an indicator ofthe identified presence or absence of repetitive information in multipledata packets.

According to some implementations of the first aspect or second aspectof the invention, the analysis includes extracting repetitiveinformation from the at least one united signal, and the signalindicative of repetitive information includes the extracted repetitiveinformation.

According to some implementations of the first aspect or second aspectof the invention, each of the sequences of samples is a single datapacket.

According to some implementations of the first aspect or second aspectof the invention, the data communication signal between the first nodeand the second node is monitored.

According to some implementations of the first aspect or second aspectof the invention, a baseband input signal is sampled and the samples areprovided for collection.

According to some implementations of the first aspect or second aspectof the invention, frequency conversion is applied to each one of thesequences of samples prior to combining the sequences of samples intothe at least one united signal.

According to some implementations of the first aspect or second aspectof the invention, for at least one of said united signals the sequencesof samples are combined by forming a weighted linear combination ofsequences of samples and delayed versions of the sequences of samples.

According to some implementations of the first aspect or second aspectof the invention, weighting coefficients are selected for the weightedlinear combination in accordance with the conditions of thecommunication channel of the network.

According to some implementations of the first aspect or second aspectof the invention, the sequences of samples are combined by specifyingmultiple sets of weighting coefficients and forming a respective unitedsignal as a weighted linear combination of the sequences of samples anddelayed versions of the plurality of the sequences of samples for eachone of the sets of weighting coefficients. The signal indicative ofrepetitive information is provided when repetitive information isidentified in at least one of the respective united signals.

According to some implementations of the first aspect or second aspectof the invention, for at least one of said united signals the sequencesof samples are combined by:

detecting a respective data packet for each one of the sequences ofsamples;

using at least one of a preamble and a synchronization sequence of thedata packets, calculating weights for combining the sequences of samplesinto a united signal; and

forming a weighted linear combination of the sequences of samples anddelayed versions of the sequences of samples using the calculatedweights.

According to some implementations of the first aspect or second aspectof the invention, the sequences of samples are combined by:

detecting a respective data packet for each one of the sequences ofsamples;

performing symbol detection on the detected data packets to obtainrespective symbol sequences; and

linearly combining the symbol sequences.

According to some implementations of the first aspect or second aspectof the invention, the sequences of samples are combined by:

detecting a respective data packet for each one of the sequences ofsamples;

decoding each of the detected data packets into respective bitsequences; and

for each position in the united signal, selecting a bit level occurringin a majority of bits at the position in the respective bit sequences.

According to some implementations of the first aspect or second aspectof the invention, for at least one of said united signals the sequencesof samples are combined by:

detecting a respective data packet for each one of the sequences ofsamples; and

for each position in the united signal, selecting a bit level having ahighest probability of occurrence at the position based on alikelihood-ratio analysis of the detected data packets.

According to some implementations of the first aspect or second aspectof the invention, respective sets of sequences of samples of the datacommunication signal are collected for each phase of a constant cycle offrequencies. At least one united signal is formed for each of the setsof sequences of samples. The signal indicative of repetitive informationis provided when repetitive information is detected in at least one ofthe respective united signals.

According to some implementations of the first aspect or second aspectof the invention, respective sets of sequences of samples of the datacommunication signal are collected for each phase of multiple cycles offrequencies. At least one united signal is formed for each of the setsof sequences of samples. The signal indicative of repetitive informationis provided when repetitive information is detected in at least one ofthe respective united signals.

According to some implementations of the first aspect or second aspectof the invention, the sample collection is synchronized to a detecteddata packet received from one of the first node and the second node.

According to some implementations of the first aspect or second aspectof the invention, the sample collection is synchronized to a detectedrequest packet.

According to some implementations of the first aspect or second aspectof the invention, the sample collection is synchronized to a detectedresponse packet.

According to some implementations of the first aspect or second aspectof the invention, the sample collection is synchronized to a cycle timeof multiple detected data packets transmitted by at least one of thefirst node and the second node.

Unless otherwise defined, all technical and/or scientific terms usedherein have the same meaning as commonly understood by one of ordinaryskill in the art to which the invention pertains. Although methods andmaterials similar or equivalent to those described herein can be used inthe practice or testing of embodiments of the invention, exemplarymethods and/or materials are described below. In case of conflict, thepatent specification, including definitions, will control. In addition,the materials, methods, and examples are illustrative only and are notintended to be necessarily limiting.

Implementation of the method and/or system of embodiments of theinvention can involve performing or completing selected tasks manually,automatically, or a combination thereof. Moreover, according to actualinstrumentation and equipment of embodiments of the method and/or systemof the invention, several selected tasks could be implemented byhardware, by software or by firmware or by a combination thereof usingan operating system.

For example, hardware for performing selected tasks according toembodiments of the invention could be implemented as a chip or acircuit.

As software, selected tasks according to embodiments of the inventioncould be implemented as a plurality of software instructions beingexecuted by a computer using any suitable operating system. In anexemplary embodiment of the invention, one or more tasks according toexemplary embodiments of method and/or system as described herein areperformed by a data processor, such as a computing platform forexecuting a plurality of instructions. Optionally, the data processorincludes a volatile memory for storing instructions and/or data and/or anon-volatile storage, for example, a magnetic hard-disk and/or removablemedia, for storing instructions and/or data. Optionally, a networkconnection is provided as well. A display and/or a user input devicesuch as a keyboard or mouse are optionally provided as well.

Other systems, methods, features, and advantages of the presentdisclosure will be or become apparent to one with skill in the art uponexamination of the following drawings and detailed description. It isintended that all such additional systems, methods, features, andadvantages be included within this description, be within the scope ofthe present disclosure, and be protected by the accompanying claims.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

Some embodiments of the invention are herein described, by way ofexample only, with reference to the accompanying drawings. With specificreference now to the drawings in detail, it is stressed that theparticulars shown are by way of example and for purposes of illustrativediscussion of embodiments of the invention. In this regard, thedescription taken with the drawings makes apparent to those skilled inthe art how embodiments of the invention may be practiced.

In the drawings:

FIG. 1 illustrates a sequence of data packets with repetitiveinformation;

FIG. 2A is a simplified block diagram of an apparatus for detectingrepetitive information in data packets communicated over a network,according to embodiments of the invention;

FIG. 2B is a simplified block diagram of a repetitive informationdetector monitoring communications between two nodes, according to anexemplary embodiment of the invention;

FIG. 3 is a simplified flowchart of a method of detecting repetitiveinformation in data packets communicated over a network, according toembodiments of the invention;

FIG. 4 is a simplified diagram illustrating the processing of a datacommunication signal according to an exemplary embodiment of theinvention;

FIG. 5 illustrates a frequency hopping transmission with a cycle oflength N; and

FIG. 6 is a simplified diagram of nodes communicating over a wirelessdata communication network.

DETAILED DESCRIPTION

The present invention, in some embodiments thereof, relates to detectingrepetitive information in a data signal and, more specifically, but notexclusively, to detecting repetitive information in data packets.

Embodiments of the invention relate to processing samples of acommunication signal so that the SNR of bit or symbol sequences thatrepeat in multiple data packets (i.e. data packets with repetitiveinformation) is increased, making it possible to detect the presence ofa particular repeating bit or symbol sequence and/or extract repetitiveinformation from the data packets. As described in more detail below,samples of a data communication signal are collected and one or moreunited signals are created from samples of multiple data packets carriedby the sampled communication signal. The united signals are analyzed todetect whether repetitive information (such as a specified datasequence) is present in the data packets.

In some cases, the goal is to determine whether a known data sequence(e.g. a packet preamble) is present in multiple data packets evenwithout the ability to actually detect the data packet (e.g. as a resultof a large distance between the reception side and the transmission sideor due to high interferences on the reception side). For example, theuser may wish to know if a response packet is present at a specificfrequency or know the addresses of the source and destination. While itmay be impossible to detect a specific data sequence in a single sampleddata packet, it may be possible to detect it when the samples frommultiple data packets are combined appropriately.

In other cases, it is desired to determine whether an unspecified datasequence repeats in multiple data packets. For example, in manycommunication protocols source and destination addresses are present inevery packet. Thus for data communication between the same source andthe same destination, the source address and the destination address arecommonly located in the same bit locations within the packet. When therate and coding modulation scheme are kept constant, the symbols of theaddress are even kept in the same location within the packet signal. (InOFDM, for example, they are located in the same OFDM frame and in thesame OFDM subcarriers and contain the same value.) If the SNR is toolow, it is not possible to extract the source and destination addressesfrom samples of a single data packet. However by combining samples ofseveral data packets into a united signal, the SNR of the repeatingsource and destination addresses may be increased enough that thecontents of the fields may be extracted.

The repetition may be identified at various levels of the signalprocessing (e.g. before or after detection of the data packets in thesamples of the data communication signal). When the data communicationsignal samples are combined into united signal(s) after data packetdetection (e.g. at the data symbol or bit level), some initialprocessing may be performed on the samples in order to detect the datapackets.

Before explaining at least one embodiment of the invention in detail, itis to be understood that the invention is not necessarily limited in itsapplication to the details of construction and the arrangement of thecomponents and/or methods set forth in the following description and/orillustrated in the drawings and/or the Examples. The invention iscapable of other embodiments or of being practiced or carried out invarious ways.

The present invention may be a system, a method, and/or a computerprogram product. The computer program product may include a computerreadable storage medium (or media) having computer readable programinstructions thereon for causing a processor to carry out aspects of thepresent invention.

The computer readable storage medium can be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer readable storage medium may be, for example, but isnot limited to, an electronic storage device, a magnetic storage device,an optical storage device, an electromagnetic storage device, asemiconductor storage device, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer readable storage medium includes the following: a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor Flash memory), a static random access memory (SRAM), a portablecompact disc read-only memory (CD-ROM), a digital versatile disk (DVD),a memory stick, a floppy disk, a mechanically encoded device such aspunch-cards or raised structures in a groove having instructionsrecorded thereon, and any suitable combination of the foregoing. Acomputer readable storage medium, as used herein, is not to be construedas being transitory signals per se, such as radio waves or other freelypropagating electromagnetic waves, electromagnetic waves propagatingthrough a waveguide or other transmission media (e.g., light pulsespassing through a fiber-optic cable), or electrical signals transmittedthrough a wire.

Computer readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagedevice via a network, for example, the Internet, a local area network, awide area network and/or a wireless network. The network may comprisecopper transmission cables, optical transmission fibers, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer readable programinstructions from the network and forwards the computer readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer readable program instructions for carrying out operations ofthe present invention may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, or either source code or object code written in anycombination of one or more programming languages, including an objectoriented programming language such as Smalltalk, C++ or the like, andconventional procedural programming languages, such as the “C”programming language or similar programming languages. The computerreadable program instructions may execute entirely on the user'scomputer, partly on the user's computer, as a stand-alone softwarepackage, partly on the user's computer and partly on a remote computeror entirely on the remote computer or server. In the latter scenario,the remote computer may be connected to the user's computer through anytype of network, including a local area network (LAN) or a wide areanetwork (WAN), or the connection may be made to an external computer(for example, through the Internet using an Internet Service Provider).In some embodiments, electronic circuitry including, for example,programmable logic circuitry, field-programmable gate arrays (FPGA), orprogrammable logic arrays (PLA) may execute the computer readableprogram instructions by utilizing state information of the computerreadable program instructions to personalize the electronic circuitry,in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer readable program instructions.

These computer readable program instructions may be provided to aprocessor of a general purpose computer, special purpose computer, orother programmable data processing apparatus to produce a machine, suchthat the instructions, which execute via the processor of the computeror other programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks. These computer readable program instructionsmay also be stored in a computer readable storage medium that can directa computer, a programmable data processing apparatus, and/or otherdevices to function in a particular manner, such that the computerreadable storage medium having instructions stored therein comprises anarticle of manufacture including instructions which implement aspects ofthe function/act specified in the flowchart and/or block diagram blockor blocks.

The computer readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational steps to be performed on the computer,other programmable apparatus or other device to produce a computerimplemented process, such that the instructions which execute on thecomputer, other programmable apparatus, or other device implement thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof instructions, which comprises one or more executable instructions forimplementing the specified logical function(s). In some alternativeimplementations, the functions noted in the block may occur out of theorder noted in the figures. For example, two blocks shown in successionmay, in fact, be executed substantially concurrently, or the blocks maysometimes be executed in the reverse order, depending upon thefunctionality involved. It will also be noted that each block of theblock diagrams and/or flowchart illustration, and combinations of blocksin the block diagrams and/or flowchart illustration, can be implementedby special purpose hardware-based systems that perform the specifiedfunctions or acts or carry out combinations of special purpose hardwareand computer instructions.

1) Repetitive Information Detector

Reference is now made to FIG. 2A, which is a simplified block diagram ofan apparatus for detecting repetitive information in data packetscommunicated over a network, according to embodiments of the invention.The apparatus (denoted herein repetitive information detector 200)includes processing circuitry 210 and optionally communication interface220.

Processing circuitry 210 collects multiple samples of wirelesscommunication signal transmissions between nodes of a wirelesscommunication network at respective times. The samples are grouped intomultiple sequences of samples (denoted sample sequences) and the samplesequences are combined into one or more united signals. The unitedsignal(s) are analyzed and a signal indicative of repetitive informationin the data packets (denoted herein an indicator signal) is providedbased on the analysis.

Repetitive information detector 200 is not a node (or part of a node) inthe wireless communication network and does not participate in thewireless communication between the nodes.

Optionally, repetitive information detector 200 monitors the wirelesscommunication between the two nodes. The monitoring may be performed ontransmissions of only one of the nodes, for example when the signalstrength of transmissions received from the other node is not highenough. This monitoring may be used to obtain information to be used ata later stage in the repetitive information detection process. Forexample, monitoring the wireless communication between the nodes mayassist in estimating the packet transmission timing and frequencies usedby the nodes.

Reference is now made FIG. 2B which is a simplified diagram of arepetitive information detector monitoring communications between twonodes, according to an exemplary embodiment of the invention. Node A 240and Node B 250 perform data communication over a wireless network.

The wireless communication between Node A 240 and Node B 250 is receivedby antenna 260 and processed by receiver 270. In the embodiment of FIG.2B, the sampling is performed by receiver 270, which provides thesamples to repetitive information detector 280. In other exemplaryembodiments, repetitive information detector 280 includes signalprocessing capabilities. In this case receiver 270 may provide anunsampled signal (e.g., an analog baseband signal) to repetitiveinformation detector 280, which then performs downconversion andsampling before combining the sample sequences into united signal(s) andanalyzing the united signal(s) to detect repetitive information.

Types of analysis that may be performed on the united signal(s) includebut are not limited to:

i) Signal presence detection;

ii) Preamble detection;

iii) Synchronization;

iv) Frequency correction;

v) Equalization; and

vi) Constellation bit extraction

Optional embodiments for combining sample sequences into a united signalinclude but are not limited to:

-   -   a) Forming a weighted linear combination of multiple sequences        of the signal samples, where there is a delay between the        multiple sequences as shown in Equation 1 below;    -   b) Detecting data packets in the signal samples and using a data        packet preamble and/or a synchronization sequence to combine the        detected data packets;    -   c) Detecting data packets in the signal samples, performing        symbol detection on the detected data packets and linearly        combining the data symbols;    -   d) Detecting data packets in the signal samples, decoding each        of the sampled data packets into bits, and for each position in        the united signal selecting a bit level occurring in a majority        of bits at that position in the data packet; and    -   e) Detecting data packets in the signal samples and selecting        the bit level having the highest probability of occurrence at        each position in the data packet. These probabilities may be        calculated, for example, by performing a likelihood-ratio        analysis of the detected data packet and/or calculating the        probability in another manner (e.g. by linear combinations of        bit probabilities at a given position in multiple data packets).

Optionally, the samples contained in each sample sequence are expectedto correspond to a single data packet.

Optionally, grouping the signal samples into sample sequences issynchronized to one or more of:

-   -   a) Transmissions received from a different source (i.e. not from        the node receiving the data packets which are being analyzed for        repetitive information);    -   b) The cycle time of some detected data packets; and    -   c) Known parameters of the communication signal (e.g. cycle time        and frequency hopping pattern).        Exemplary embodiments for establishing the timing for grouping        the signal samples are described in Section V below.

Referring again to FIG. 2A, optionally repetitive information detector200 includes communication interface 220. Different embodiments ofcommunication interface 220 may input signals at one or more stages ofsignal reception (e.g. RF, baseband, digitized after analog-to-digitalconversion, etc.).

Non-limiting examples of signals which may be input by communicationinterface 220 include but are not limited to:

-   -   1) Wireless signal—communication interface 220 optionally        includes wireless receiver 221 (e.g. an RF receiver) which        receives a wireless signal carrying the data packets and may        also perform signal processing, such as downconverting and        sampling the received communication signal;    -   2) Data signal after downconversion—communication interface 220        optionally includes sampler 222 which inputs and samples analog        baseband signals. Sampler 222 may also perform analog to digital        (A/D) conversion on the baseband signal samples; and    -   3) Digital signal—optionally communication interface 220 inputs        the sample values in a digitized format after the received        communication signal has been sampled and undergone A/D        conversion.

Optional embodiments for ensuring that the data packet is sampled at thecorrect time stamps are described in Section V below.

As used herein the term “data sequence” means a sequence of symbols orbits within a data packet. It is noted that the term “data sequence” isnot limited to the data payload in the data packet but may include thecontents of other portions of the data packet.

As used herein the term “repetitive information” means a data sequencethat is present in multiple data packets.

As used herein the term “detect repetitive information” means that it isdetermined whether a specified or unspecified data sequence repeats inmultiple data packets.

As used herein the terms “samples of a communication signal”, “signalsamples” and “samples” means the respective levels of the communicationsignal (before or after downconversion) at multiple sampling times.

As used herein the terms “sequence of samples” and “sample sequence”means a sequence of consecutive samples of a communication signal.

As used herein the term “collecting samples” means storing or bufferinga series of samples of a communication signal so that they may later becombined into one or more united signals.

As used herein the terms “combining sequences of samples” and “samplesequences are combined” means that an operation (e.g. mathematical,logical, numerical, etc.) is performed on the sample sequences resultingin a single signal. Combining signals optionally includes detection ofdata packets in the sequences and performing operations on detected datapackets.

As used herein the term “united signal” means the result of thecombination of multiple sample sequences.

As used herein the term “time stamp” means the time at which thecommunication signal is sampled. Each sample has a respective timestamp. For a given packet, the time stamp of the first sample of thepacket indicates the time at which sample collection for that packetshould begin.

Optionally, the analysis includes detecting whether repetitiveinformation is present or absent in one or more of the united signal(s)and the indicator signal indicates whether repetitive information ispresent or absent in the data packets. Further optionally, the analysisincludes identifying whether a specified signal is present or absent inone or more of the united signal(s). In some cases, an indicator signalmay be provided only when the presence of repetitive information isidentified.

Alternately or additionally, the analysis includes extracting repetitiveinformation from one or more of the united signal(s) and the indicatorsignal includes the extracted repetitive information. Furtheroptionally, an indicator signal is not provided unless repetitiveinformation is extracted from one or more united signal(s).

Optionally, the repetitive information includes one or more of:

a) A packet preamble (also denoted herein a preamble signal);

b) A packet synchronization sequence (also denoted herein a syncsignal);

c) A source address;

d) A destination address; and

e) A sequence of data bits and/or data symbols.

Optionally, the sampled data packets are combined into a single unitedsignal and the analysis is performed on the single united signal. Thisapproach minimizes the amount of processing and analysis required inorder to provide the indicator signal and may be beneficial in caseswhere the parameters of data packet transmission are known.

Alternately, the sampled data packets are combined into multiple unitedsignals and the analysis is performed on the multiple united signals.Each united signal is effectively a hypothesis of how the signals shouldbe combined. The analysis tests the various hypotheses to determine ifrepetitive information may be detected and/or extracted from one or moreof the united signals. This approach is beneficial in cases whereparameters of data packet transmission are unknown (e.g. in frequencyhopping signals where the carrier frequency cycle is unknown).

Exemplary embodiments of detecting the presence of a specified datasequence (e.g. a sync and/or preamble sequence) in repeating in multipledata packets under different frequency hopping schemes are described inSections 3.2-3.3 below. Exemplary embodiments of detecting if anunspecified data sequence repeats in multiple data packets underdifferent coding and modulation transmission schemes are described inSections 4.1-4.3 below.

Optionally, repetitive information detector 200 includes internal memory230 which may be used to store the signal samples. The stored samplesare thus easily accessible to processing circuitry 210 for analysis.

Optionally, the processing circuitry performs additional signalprocessing on the extracted repetitive information (e.g. demodulates theextracted repetitive information into data symbols or data bits).

2) Method of Detecting Repetitive Information in Data Packets

Reference is now made to FIG. 3 , which is a simplified flowchart of amethod of detecting repetitive information in data packets communicatedover a network, according to embodiments of the invention.

In 310, samples of a communication signal transmitted between two nodesare collected at different respective times. Optionally 310 includessampling the communication signal after downconversion. Alternately, thedata signal sample values may be input via a digital communicationinterface. The device performing sample collection is not a participantin the communication between the two nodes.

Optionally, in 305, the data communication signal between two nodes ismonitored, for example in order to determine whether samples of thecommunication signal should be collected and/or the timing of the samplecollection.

In 320, the samples are grouped into sample sequences. Optionally, thelength of each sample sequence is selected so that each sample sequenceincludes samples of a single data packet, if the start of each samplesequence correctly aligns with the first sample of a data packet.

In 330, multiple sample sequences are combined into one or more unitedsignals. Optionally, the sample sequences are combined by an operationon the signal sample values themselves (e.g. by weighted linearcombination as described in Section 4.1). Alternately data packets aredetected in the sample sequences and the combination is performed at thedata packet, symbol or bit level (as described in Section 5).

In 340, the united signal or signals are analyzed and an indicatorsignal is provided when the result of the analysis indicates thatrepetitive information is present in multiple data packets. Optionally,the indicator signal is provided only when repetitive information isidentified in and/or extracted from one or more of the united signal(s).

In some cases, the communication network may use frequency hoppingtransmission (with or without a known cycle). In order to collectsamples of the signal carrying the data packets, the communicationsignal is downconverted from the current frequency, before the samplesare collected and/or combined (e.g. see FIG. 4 ). When the currentcarrier frequency is unknown, samples may be collected for communicationsignals at multiple carrier frequencies. Several united signals may beformed from the samples collected at the various frequencies andanalyzed to determine whether repetitive information is detected in oneor more of them.

In a first exemplary embodiment, the frequency hopping signal istransmitted over a constant cycle of frequencies. A respective set ofsample sequences is collected for each phase in the cycle. One or moreunited signal(s) are formed for each of the sets. The indicator signalis provided when repetitive information is detected in at least one ofthe united signal(s).

In a second exemplary embodiment, the frequency hopping signal istransmitted over constant cycle of frequencies but the cycle itself isunknown. Respective sets of sample sequences are collected for eachphase of multiple cycles of transmission frequencies, where each of thecycles is an estimate of a possible cycle of frequencies being used fortransmission. One or more united signal(s) are formed for each of thesets. The indicator signal is provided when repetitive information isdetected in at least one of the united signal(s).

Reference is now made to FIG. 4 , which is a simplified diagramillustrating the processing of a data communication signal according toan exemplary embodiment of the invention. In the present example, theindicator signal indicates whether a specified data sequence has beendetected in the united signal. Assuming that the SNR was too low todetect the data sequence in a single data packet, this means that thespecified data sequence is repeated in multiple data packets.

In 410, the analog signal modulated with the data packets isdownconverted and filtered.

In 420, the downconverted signal is sampled and the analog-to-digital(A/D) conversion is performed on the samples. Exemplary embodiments ofaligning the sampling times to the arrival times of the data packets isdescribed in Section V below.

In 430, the signal samples are collected in a buffer.

In 440, the buffered samples are combined into one or more unitedsignals.

In 450, the united signal(s) are analyzed and an indicator signal isprovided when the specified data sequence is detected in at least one ofthe united signal(s).

In some exemplary embodiments, repetitive information detector performsall of the processing stages shown in FIG. 4 . In alternate embodimentssome or all of, downconversion and filtering (410), sampling and A/Dconversion (420) and buffer collection 430 may be performed externally.During 440, the repetitive information detector retrieves the storedsignal samples and combines them into the united signal(s).

3) Combining Sample Sequences into a United Signal

The manner of combining the samples into a united signal may depend onthe quality of the received communication signal. Embodiments forcombining sampled data packets into a united signal are now described.

In a first optional embodiment, which may be performed before datapacket detection (e.g. when SNR is too low to detect data packets in thecommunication signal) the samples are combined into a united signal byweighted linear combination of sequences of samples, as described inmore below.

Alternate optional embodiments may be performed after data packetdetection, when the quality of the received signal is adequate fordetecting data packets from the signal samples but the SNR is not highenough to extract the repetitive information from the identified datapackets. Exemplary embodiments include but are not limited to:

-   -   a) Uniting the sampled data packets into a single data packet by        performing a linear combination of delayed versions of the        signal samples, optionally using the preamble and/or        synchronization sequence of the data packets and/or parts of the        payload itself.    -   b) Performing symbol detection on the sampled data packets to        obtain respective symbol sequences and linearly combining the        symbol sequences. For example, symbols may be achieved (before        or after equalization, but before de-mapping or any other symbol        to bits method) or LLRs (log-likelihood-ratios) from each packet        and be averaged coherently before de-mapping into bits (or any        other method to extract bits from symbols, such as MLSE        decoding).    -   c) Decoding each of the sampled data packets into a respective        bit sequence and, for each position in the united signal        selecting a bit level occurring in a majority of bits at that        position in the bit sequences.    -   d) Selecting the bit level having the highest probability of        occurrence at each position in the data packet.

As used herein the term “delayed versions of the signal samples” meansthe samples of multiple data packets (packets 0 to K−1) with delay m,given as x_(k)[n−m] in Equation 1 below.

3.1) Weighted Linear Combination

Optionally, the sampled data packets are combined into a united signalas a weighted linear combination of sequences of samples of thecommunication signal where the sequences have differing delays, as shownin Equation 1 below. The expected times of arrival of the data packetsare known but it is unknown whether the data sequence(s) are actuallypresent in the data packets. When the data sequence repeats in thesampled data packets, combining the samples by linear combinationimproves the SNR of the repeating data sequence so that it may be moreeasily detected by a detection mechanism (e.g. cross correlation with areference series).

Using a weighted linear combination to form a united signal isparticularly beneficial in cases where it is desired to detect thepresence of a fixed data sequence (e.g. packet preamble) or a fixedvariant of a set of possible data sequences (e.g. packet sync sequence).Note than the united signal may still have residual impairments, such aschannel response and frequency offset.

The data packet samples may be combined by performing a weighted linearcombination in accordance with Equation 1:

$\begin{matrix}{{x_{united}\lbrack n\rbrack} = {\sum\limits_{k = 0}^{K - 1}\;{\sum\limits_{m = 0}^{M - 1}\;{h_{k,m} \cdot {x_{k}\left\lbrack {n - m} \right\rbrack}}}}} & (1)\end{matrix}$where h_(k,m) is a set of weighting coefficients and x_(k)[n−m] are thesamples of multiple data packets (packets 0 to K−1) with delay m. Foreach data packet k, h_(k,m) may be seen as an equalizer.

Optionally, the h_(km) weighting coefficients are selected in accordancewith conditions of the communication channel, for example by channelestimation, MRC (maximum ratio combining) and/or other channelequalization methods Channel estimation may be performed by crosscorrelation of the input signals with a reference signal (if one isknown) or by cross correlation of the input signals with one another.

Optionally, multiple united signals are formed for the same samplesusing different (typically predefined) weighting sets. An analysis isperformed on each of the united signals. An indicator signal is providedwhen the presence of repetitive information is identified in and/orextracted from at least one of the united signals.

An exemplary embodiment of detecting a specified data sequence usingmultiple predefined weighting sets is described by the following pseudocode:

Select K sample sequences Loop over sets of h_(k,m):  Unite the Ksignals using Equation 1  Attempt detection of the specified datasequence in the united signal  Stop upon successful detection andindicate detection was found3.2) Detection of a Known Data Sequence in Frequency HoppingTransmission with a Constant Known Cycle

Optionally, the weighted linear combination method is used to determinethe presence or absence of a known data sequence or a fixed variant ofpossible data sequences (e.g. sync and/or preamble sequences) infrequency hopping transmissions with constant known cycle. In this typeof transmission, a packet is transmitted at known time intervals and atdifferent frequencies. The frequency sequence repeats after N packetshave been transmitted (as illustrated by FIG. 5 ).

The processing circuitry collects samples at multiple known frequenciesaccording to a constant cycle.

In a first exemplary embodiment, a single united signal is formed foreach for each phase of the frequency cycle (where the term phase means atime within the N sequence of carrier frequencies). In other words, ifthe frequency cycle repeats every N data packets, N united signals areformed. The united signals combines the samples at respective potentialphases of the frequency hopping signal. Each of united signals isanalyzed to detect if the known data sequence (or variant) is present,for example by cross correlation of each of the united signals with thedata sequence being sought. If one of the phases includes multipleinstantiations of the known data sequence (or variant), detection willoccur at that phase. An indicator signal is provided when the datasequence (or one of the variants of the sequence) is detected in atleast one of the respective united signals.

In a second exemplary embodiment, multiple united signals are formed foreach for each phase of the frequency cycle, each of the united signalsbeing generated by a respective weighting set h_(k,m). The data samplesare combined for each h_(k,m) set in turn at each of the possiblephases. The procedure stops when repetitive information is found in thecurrent united signal (i.e. with the current h_(k,m) and current phased). In this case the procedure may be described by the followingpseudocode:

Loop over starting phase (index of first packet) d = 0 . . . (N-1): Select K sample sequences by their index: d, d + N, . . . , (d + K − 1) · N  Loop over sets of h_(k,m):   Unite the k signals using Equation1   Attempt detection of the specified data sequence in the unitedsignal   Stop upon successful detection and indicate detection is foundat phase d

In a third exemplary embodiment, the detection of repetitive informationalso includes a quality figure of merit which describes the quality ofthe detection decision. The correct phase of the sampled data packets isdecided based on the quality figure of merit. The procedure may bedescribed by the following pseudocode:

Loop over starting phase (index of first packet) d = 0 . . . (N-1) Select K sample sequences by their index: d, d + N, . . . , (d + K − 1) · N  Loop over sets of h_(k,m):   Unite the k signals using Equation1   Attempt detection of the specified data sequence in the unitedsignal   Upon successful detection collect a quality figure of meritSelect the phase with the best quality figure of meritExamples of the quality figure of merit include but are not limited to:SNR, signal variance, correlation peak value.

In a fourth exemplary embodiment, the frequency cycle is constant butthere are several possibilities of what this constant cycle might be,{N₀, N₁, . . . , N_(u)}. In this case the selection of samples tocombine is also looped over all the frequency cycle possibilities:

Loop over cycles N_(i) = {N₀, N₁, . . . , N_(u)}:  Loop over startingphase (index of first packet) d = 0 . . . (N_(i)-1):   Select K samplesequences by their index: d, d + N, . . . , (d + K −   1) · N   Loopover sets of h_(k,m):    Unite the k signals using Equation 1    Attemptdetection of the specified data sequence in the    united signal    Stopupon successful detection and indicate detection is    found at phase dand in cycle N_(i)3.3) Detection of Repetitive Information in Frequency Hopping Scenario,with Constant Unknown Cycle or with No Cycle

In some cases the network communicates by frequency hopping over knownfrequencies. However, the cycle may not be known or even constant. Theapproach utilized for the constant known cycle in Section 3.2 above maybe adapted to these cases by gathering signals into potential sets whichare formed using several hypotheses or by performing correlation betweenthe signals.

Optionally, the processing circuitry collects respective sets of sampleddata packets at the known frequencies for multiple cycle lengths (eitherconstant cycle lengths or differing cycle lengths). At least onerespective united signal is formed for each set of sampled data packetsat the constant cycle or the different cycle lengths. Each of the unitedsignals is analyzed. The indicator signal is provided when repetitiveinformation is identified in and/or extracted from at least one of therespective united signals

When the timing of the data packet capture and/or sampling is based ondata packets received from another source (for examples see Sections 5.1or 5.2 below), estimated cycle hypotheses may be made based on the timedifference of every two received packets or by an integer denominator oftwo receptions. For example, if receptions are found at times 20 msec,50 msec and 70 msec, potential cycles may be 2 msec, 5 msec and 7 msec.

4) Detection of Repetitive Information in Detected Data Packets

Optionally, data packets are detected in the sample sequences and thesample sequences are combined after data packet detection. Furtheroptionally, each sample sequence is decoded into a respective datapacket.

This approach is beneficial when the SNR is high enough to detect datapackets in the communication signal but not high enough to extract thebits from the data packets.

Exemplary embodiments for combining the data packets detected in thesignal samples include but are not limited to:

-   -   Embodiment A: Using a data packet preamble and/or a        synchronization sequence;    -   Embodiment B: Obtaining respective symbol sequences by        performing symbol detection on the sampled data packets and        linearly combining the data symbol sequences    -   Embodiment C: Decoding each of the sampled data packets into        respective bit sequences and for each position in the united        signal, selecting a bit level occurring in a majority of bits at        the position in the respective bit sequences; and    -   Embodiment D: Selecting the bit level having the highest        probability of occurrence at each position in the data packet.

Note that the exemplary embodiment extracts the PHY layer bits (rightbefore mapping stage), without going into further details of extractinginformation bits after de-interleaving, de-scrambling and decoding FEC(forward error correction). These stages may be performed separately.Because the bits are constant and pass through the same stages ofinterleaving, scrambling and FEC encoding, etc. there is a highprobability that most of them will also be constant in the PHY layerlevel.

The repeating bits or symbols may contain information including but notlimited to:

a) Source address;

b) Destination address;

c) Cell identifier; and

d) Any other information that is constant in multiple packets.

4.1) Detection of Co-Located Repetitive Data Bits when Rate and CodingModulation are Constant

The instant exemplary embodiment is directed at detecting repeating databits or symbols which are located at the same location within detecteddata packets (i.e. at the same bit index from the packet start bit) whenthe rate and coding modulation are constant.

In order to unite the entire data packets (as in exemplary embodiment Aabove), the data packets should be transmitted by the transmitter at thesame frequency. Optionally, in cases in which the data packets are nottransmitted at the same frequency, the receiver performs frequencycorrection to convert all the data packets to the same basebandfrequency to ensure that the data packets do not have a frequency offsetbetween them. In alternate optional embodiments, if the detected datapackets which are being combined share the same frequency, thenfrequency offset correction before uniting may be skipped, because afrequency offset between the packets is not expected.

When uniting the detected data packets at the symbol level (as inexemplary embodiment B above), the packets may arrive at differentfrequencies (e.g. in frequency hopping scenarios). In addition, coherentaveraging may be performed after adjusting the phase between the symbolsand is required only if the symbols are before equalization. Weightedlinear combination may be applied if the SNR is different between theaveraged symbols.

4.2) Detection of Co-Located Repetitive Data Bits when Rate and CodingModulation are not Constant

When the rate or coding modulation are not constant, it is not possibleto perform exemplary embodiments A-C on all the detected data packetsdirectly.

Optionally, detected packets that share the same rate and codingmodulation are selected and then are treated similarly to combining datapackets with constant rate and coding modulation as described above inSection 4.1.

In cases in which only the rate changes but the coding is the same (e.g.with the same forward error correction but no puncturing), exemplaryembodiments B and C may be used. Averaging per-bit metrics, such as LLRbefore de-mapping or any other method for bit extraction may beimplemented. Also bit averaging may be performed after bit extraction.Weighted sum combination may be used, so that lower rate bits (withhigher SNR, which is this case is bit energy to noise ratio) may receivea higher weight than the high rate bits.

In cases with the same forward error correction (FEC) but differentpuncturing, exemplary embodiment C may be used. The unpunctured bits(before or after mapping) are combined, improving their SNR while takinginto consideration the punctured bits that should not be averaged. Forexample, if the bits without puncturing are X0,X1,X2 and X3, and inanother packet Y0,Y1,Y2 and Y3, and after puncturing in another packetZ0,Z1,Z3 (rate 3/4), the bits may be averaged as: (X0+Y0+Z0)/3,(X1+Y1+Z1)/3, (X2+Y2)/2, (X3+Y3+Z3)/3.

4.3) Detection of Repetitive Data Bits, which are not Co-Located

Optionally, when the repetitive information is not located in the samelocation in the data packet but the coding scheme is the same (e.g. nopuncturing), the position of the repetitive bits is found by correlationbetween the packets.

5) Aligning Sample Sequences with Data Packet Arrival Times

In order to combine the signal samples correctly into a united signal,the samples contained in the sample sequences must be aligned with thesampling times of the data packets.

Optionally, data packet sampling is synchronized to a data packetdetected in the transmission between nodes participating in the wirelesscommunication (e.g. from Node A or Node B in FIG. 2B). Furtheroptionally, the data packet sampling is synchronized to at least one of:

-   -   a) Request packet(s) detected in the signal received from the        different source; and    -   b) Response packet(s) detected in the signal received from the        different source.

To illustrate this approach, reference is now made to FIG. 6 which is asimplified diagram of nodes communicating over a wireless datacommunication network. In FIG. 6 , Node A 610 and Node B 620 communicateover a wireless network. It is desired to detect and/or extractrepetitive information from signals transmitted by Node A. Receiver 630receives transmissions from Node A 610 with very low SNR. Howevertransmissions from Node B 620 are received by receiver 630 with goodenough SNR to detect data packets in signals transmitted by Node B. Thusthe grouping of signal samples into sample sequences may be synchronizedto the timing of data packets detected in the received Node B signal.

Alternately or additionally, the time stamps for grouping samples intosample sequences are based on a cycle time of multiple detected datapackets.

Following are exemplary embodiments for collecting the samples at thecorrect sampling times.

5.1) Sampling Based on Received Request or Response Packets

In a first exemplary embodiment, the timing of the data packet samplingis established based on a request or response packet received from adifferent source (e.g. Node B).

Node B may be transmitting response packets to Node A (e.g. acknowledgepackets or clear-to-send packets). Node B may also be sending actualdata to Node A, which returns response packets. Another possibility isthat Node A and Node B have TDD communication and each side transmits inits own turn.

Optionally, when a transmission from a different source (e.g. Node B) isreceived with adequate SNR, the time stamps for collecting the requiredpackets (e.g. from Node A) are set to a constant time interval before orafter the start time or end time of the data packet(s) received fromNode B. Response packets are typically sent after the end of the requestpacket, thus the time stamp for collecting the next data packet is aconstant time interval after the end of the request packet received fromthe different source. Request packets are typically sent before theresponse packets, thus the time stamp for collecting the next datapacket is a constant time interval before the expected start time of thenext request packet from the different source.

5.2) Synchronization by Received Data Packets

In a second exemplary embodiment, it is assumed (or known) that there isa constant cycle time for data packet transmissions. Additionally, someof the data packets sent to Node A are detectable. The sampling timestamps may additionally be based on the transmission from another source(e.g. request and/or response packets received from a different sourceas in the Section 5.1 above).

Optionally, the cycle time for the data packet reception is estimatedaccording to the detectable data packets. The cycle time may be found bysearching for timings that support Equation 2 below or by any otherinteger linear optimization criteria that searches for a cycle T whenthe vector of some receptions {T_(n)} is known.

$\begin{matrix}{{{cycle}\mspace{14mu}{time}},{{{initial}\mspace{14mu}{phase}} = {\underset{T,T_{0}}{\quad{argmin}}{\sum\limits_{i = 1}^{N}\;{{T_{i} - T_{0} - {{{round}\left( \frac{T_{i} - T_{0}}{T} \right)} \cdot T}}}^{2}}}}} & (2)\end{matrix}$

When an estimated value of T exists (for example if the cycle time isknown, except for clock errors), Equation 2 may be changed to Equation3:

$\begin{matrix}{{{cycle}\mspace{14mu}{time}},{{{initial}\mspace{14mu}{phase}} = {\arg{\min\limits_{T,T_{0}}{\sum\limits_{i = 1}^{N}{{T_{i} - T_{0} - {{{round}\left( \frac{T_{i} - T_{0}}{T_{est}} \right)} \cdot T}}}^{2}}}}}} & (3)\end{matrix}$

Once cycle time and initial phase are known, the required signal may becaptured at the expected time stamps according to Equation 4:sample collection time stamp(n)=(cycle time)·n+(initial phase)  (4)5.3) Synchronization for Fixed Frequency or Frequency HoppingTransmission with a Known Cycle Time

In this scenario there is a constant cycle time of data packettransmission and the cycle time is known (or multiple possibilities ofthe cycle time are known). Additionally, the wireless signaltransmission is at a known single frequency (or within a known list offrequencies) or in a fixed frequency hopping sequence. For the frequencyhopping case, the frequency list is at least partially known and thatthere is a fixed cycle of frequencies that are transmitted (i.e. F1, F2,. . . FN, F1, F2, FN . . . ).

Data packet sampling is performed at known time stamps every cycle.Several overlapping captures may also be performed.

For example, a signal with a known cycle of 10 msec is transmitted witha known frequency hop cycle of four known frequencies {F1, F2, F3, F4}.A typical packet length is expected to be 1 msec. Thus every 10 msec a 1msec signal is expected, and every 40 msec a signal is expected at thesame frequency.

A frequency, Fk, is selected from the list and the received signal isfiltered for Fk only. Groups of signals that are greater than 1 mseclong are collected, say 2 msec. Signals are added to the same group whentheir start times are integer multiples of 40 msec from one another.Thus group 1 contains signals starting at times: 0, 40, 80, 120, . . .Group 2 contains 2 msec signals starting at times: 1, 41, 81, 121, . . .(note the overlapping of 1 msec). Group 3 contains 2 msec signalsstarting at times: 2, 42, 82, 122, . . . . The signals are collected inthis manner until the final group which contains 2 msec signals startingat times: 39, 79, 119, 159, . . . .

For each one of the groups, approaches similar to those described abovemay be adapted to determine if a signal is present in this group ofsignals. For example, many linear combinations of the signals within thegroup may be made and then the result may be passed through a detectionmechanism.

If the correct packet cycle or hop cycle is not known but there areseveral possibilities for the hop cycle, each possible hop cycle maytested until a signal is found.

5.4) Synchronization by Known Cycle Time Possibilities for a DynamicFrequency Hopping Pattern

In this scenario that there is a constant cycle time of the transmissionand the cycle time is known (or multiple possibilities of the cycle timeare known). The frequency hopping pattern is dynamic (i.e. the order ofthe frequencies transmitted in each cycle may change and/or not allfrequencies must be transmitted in every cycle).

In this case, every two captures above may be correlated and the twosignals will be associated with the same group only if there is a highenough correlation between them.

Correlation between two signals may be calculated as Equation 5:

$\begin{matrix}{{{corr}\left( {i,j} \right)} = {\max\limits_{N_{0}}\left\{ {{\sum\limits_{n = 0}^{N_{0} + N - 1}\;{{x_{i}\lbrack n\rbrack} \cdot {x_{j}^{*}\lbrack n\rbrack}}}} \right\}}} & (5)\end{matrix}$If corr(i,j)>threshold, the two signals i and j belong to the samegroup.

When the transmission uses a fixed rate and coding modulation scheme,packets may be correlated either before symbol extraction (i.e. the rawsignal), after symbol extraction before bit metric creation (such as loglikelihood ratio per bit or per bit group) or after bit metric creation(and before FEC decoding if it exists). Frequency offset and channelresponse may be expected to remain nearly constant and only phase isexpected to change (e.g. sampling phase, local oscillator phase). Incase of multiple-in multiple-out (MIMO) transmission, multiple channelsare expected to change similarly (e.g. the phase changes in the sameway) and other transmission parameters may be expected to remainconstant (e.g. frequency offset and/or channel response).

In summary, the embodiments presented herein provide a solution for thetechnical problem of detecting and/or extracting data from received datapackets under conditions of low SNR which otherwise would make suchdetection and/or extraction impossible. Samples of the communicationsignal samples are processed as described above so that the SNR ofinformation (e.g. a sequence of symbols) which repeats in multiple datapackets is increased to a level which enables detecting and/orextracting the repetitive information. Multiple approaches for aligningthe signal sequences with data packet receptions are also presented.Proper alignment improves the effectiveness of combining multiple samplesequences into united signal(s), resulting in even greater improvementof the SNR of the repetitive information.

The methods as described above are used in the fabrication of integratedcircuit chips.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof code, which comprises one or more executable instructions forimplementing the specified logical function(s). It should also be notedthat, in some alternative implementations, the functions noted in theblock may occur out of the order noted in the figures. For example, twoblocks shown in succession may, in fact, be executed substantiallyconcurrently, or the blocks may sometimes be executed in the reverseorder, depending upon the functionality involved. It will also be notedthat each block of the block diagrams and/or flowchart illustration, andcombinations of blocks in the block diagrams and/or flowchartillustration, can be implemented by special purpose hardware-basedsystems that perform the specified functions or acts, or combinations ofspecial purpose hardware and computer instructions.

The descriptions of the various embodiments of the present inventionhave been presented for purposes of illustration, but are not intendedto be exhaustive or limited to the embodiments disclosed. Manymodifications and variations will be apparent to those of ordinary skillin the art without departing from the scope and spirit of the describedembodiments. The terminology used herein was chosen to best explain theprinciples of the embodiments, the practical application or technicalimprovement over technologies found in the marketplace, or to enableothers of ordinary skill in the art to understand the embodimentsdisclosed herein.

It is expected that during the life of a patent maturing from thisapplication many relevant data packet formats, communication signaltransmission schemes, frequency hopping transmissions, rate and/orcoding of transmitted data, signal sampling, techniques for combiningsequences, correlation techniques, data packet detection techniques andtechniques for extraction of data symbols and/or bits from detected datapackets will be developed and the scope of the terms data packet,communication signal, frequency hopping, rate, coding, samplingcommunication signals, combining sequences, correlation, detection ofdata packets and extraction are intended to include all such newtechnologies a priori.

The terms “comprises”, “comprising”, “includes”, “including”, “having”and their conjugates mean “including but not limited to”. This termencompasses the terms “consisting of” and “consisting essentially of”.

The phrase “consisting essentially of” means that the composition ormethod may include additional ingredients and/or steps, but only if theadditional ingredients and/or steps do not materially alter the basicand novel characteristics of the claimed composition or method.

As used herein, the singular form “a”, “an” and “the” include pluralreferences unless the context clearly dictates otherwise. For example,the term “a compound” or “at least one compound” may include a pluralityof compounds, including mixtures thereof.

The word “exemplary” is used herein to mean “serving as an example,instance or illustration”. Any embodiment described as “exemplary” isnot necessarily to be construed as preferred or advantageous over otherembodiments and/or to exclude the incorporation of features from otherembodiments.

The word “optionally” is used herein to mean “is provided in someembodiments and not provided in other embodiments”. Any particularembodiment of the invention may include a plurality of “optional”features unless such features conflict.

Throughout this application, various embodiments of this invention maybe presented in a range format. It should be understood that thedescription in range format is merely for convenience and brevity andshould not be construed as an inflexible limitation on the scope of theinvention. Accordingly, the description of a range should be consideredto have specifically disclosed all the possible subranges as well asindividual numerical values within that range. For example, descriptionof a range such as from 1 to 6 should be considered to have specificallydisclosed subranges such as from 1 to 3, from 1 to 4, from 1 to 5, from2 to 4, from 2 to 6, from 3 to 6 etc., as well as individual numberswithin that range, for example, 1, 2, 3, 4, 5, and 6. This appliesregardless of the breadth of the range.

Whenever a numerical range is indicated herein, it is meant to includeany cited numeral (fractional or integral) within the indicated range.The phrases “ranging/ranges between” a first indicate number and asecond indicate number and “ranging/ranges from” a first indicate number“to” a second indicate number are used herein interchangeably and aremeant to include the first and second indicated numbers and all thefractional and integral numerals therebetween.

It is appreciated that certain features of the invention, which are, forclarity, described in the context of separate embodiments, may also beprovided in combination in a single embodiment. Conversely, variousfeatures of the invention, which are, for brevity, described in thecontext of a single embodiment, may also be provided separately or inany suitable subcombination or as suitable in any other describedembodiment of the invention. Certain features described in the contextof various embodiments are not to be considered essential features ofthose embodiments, unless the embodiment is inoperative without thoseelements.

Although the invention has been described in conjunction with specificembodiments thereof, it is evident that many alternatives, modificationsand variations will be apparent to those skilled in the art.Accordingly, it is intended to embrace all such alternatives,modifications and variations that fall within the spirit and broad scopeof the appended claims.

All publications, patents and patent applications mentioned in thisspecification are herein incorporated in their entirety by referenceinto the specification, to the same extent as if each individualpublication, patent or patent application was specifically andindividually indicated to be incorporated herein by reference. Inaddition, citation or identification of any reference in thisapplication shall not be construed as an admission that such referenceis available as prior art to the present invention. To the extent thatsection headings are used, they should not be construed as necessarilylimiting.

What is claimed is:
 1. An apparatus for detecting repetitive informationin data packets communicated between a first node and a second node overa wireless network, comprising: processing circuitry configured to:collect samples of a data communication signal transmitted between saidfirst node and said second node over said wireless network at aplurality of respective times; group said collected samples into aplurality of sequences of samples; combine said plurality of sequencesof samples into at least one united signal; and based on an analysis ofsaid at least one united signal, provide a signal indicative ofrepetitive information in a plurality of data packets carried by saiddata communication signal.
 2. An apparatus according to claim 1, whereinsaid analysis comprises identifying a presence or absence of repetitiveinformation in said at least one united signal, said signal indicativeof repetitive information comprising an indicator of said identifiedpresence or said absence of repetitive information in said plurality ofdata packets.
 3. An apparatus according to claim 1, wherein saidanalysis comprises extracting repetitive information from said at leastone united signal, said signal indicative of repetitive informationcomprising said extracted repetitive information.
 4. An apparatusaccording to claim 1, wherein each of said plurality of sequences ofsamples comprises a single data packet.
 5. An apparatus according toclaim 1, wherein said processing circuitry is further configured tomonitor said data communication signal transmitted between said firstnode and said second node.
 6. An apparatus according to claim 1, furthercomprising a sampler configured for sampling a baseband input signal andfor providing said samples to said processing circuitry for saidcollecting.
 7. An apparatus according to claim 1, wherein frequencyconversion is applied to each one of said plurality of sequences ofsamples prior to said combining said plurality of sequences of samplesinto said at least one united signal.
 8. An apparatus according to claim1, wherein said processing circuitry is configured to perform saidcombining by forming a weighted linear combination of the plurality ofsequences of samples and delayed versions of said plurality of saidsequences of samples.
 9. An apparatus according to claim 8, wherein saidprocessing circuitry is configured to select weighting coefficients forsaid weighted linear combination in accordance with conditions of acommunication channel of said network.
 10. An apparatus according toclaim 1, wherein said processing circuitry is configured to perform saidcombining by: specifying a plurality of sets of weighting coefficients;and forming a respective united signal as a weighted linear combinationof the plurality of sequences of samples and delayed versions of saidplurality of sequences of samples for each one of said sets of weightingcoefficients, said signal indicative of repetitive information beingprovided when repetitive information is identified in at least one ofsaid respective united signals.
 11. An apparatus according to claim 1,wherein said processing circuitry is configured to perform saidcombining by: detecting a respective data packet for each one of saidplurality of sequences of samples; using at least one of a preamble anda synchronization sequence of said data packets, calculating weights forcombining said plurality of sequences of samples into a united signal;and forming a weighted linear combination of said plurality of sequencesof samples and delayed versions of said plurality of said plurality ofsequences of samples using said calculated weights.
 12. An apparatusaccording to claim 1, wherein said processing circuitry is configured toperform said combining by: detecting a respective data packet for eachone of said plurality of sequences of samples; performing symboldetection on said detected data packets to obtain respective symbolsequences; and linearly combining said symbol sequences.
 13. Anapparatus according to claim 1, wherein said processing circuitry isconfigured to perform said combining by: detecting a respective datapacket for each one of said plurality of sequences of samples; decodingeach of said detected data packets into respective bit sequences; andfor each position in said at least one united signal, selecting a bitlevel occurring in a majority of bits at said position in saidrespective bit sequences.
 14. An apparatus according to claim 1, whereinsaid processing circuitry is configured to perform said combining by:detecting a respective data packet for each one of said plurality ofsequences of samples; and for each position in said at least one unitedsignal, selecting a bit level having a highest probability of occurrenceat said position based on a likelihood-ratio analysis of said detecteddata packets.
 15. An apparatus according to claim 1, wherein saidprocessing circuitry is configured to collect said samples insynchronization with a detected data packet received from one of saidfirst node and said second node.
 16. An apparatus according to claim 1,wherein said processing circuitry is configured to collect said samplesin synchronization with a detected request packet.
 17. An apparatusaccording to claim 1, wherein said processing circuitry is configured tocollect said samples in synchronization with a detected response packet.18. An apparatus according to claim 1, wherein said processing circuitryis configured to collect said samples in synchronization with a cycletime of a plurality of detected data packets transmitted by at least oneof said first node and said second node.
 19. A method of detectingrepetitive information in data packets communicated between a first nodeand a second node over a wireless network, comprising: collectingsamples of a data communication signal transmitted between said firstnode and said second node over said wireless network at a plurality ofrespective times; grouping said collected samples into a plurality ofsequences of samples; combining said plurality of sequences of samplesinto at least one united signal; and based on an analysis of said atleast one united signal, providing a signal indicative of repetitiveinformation in a plurality of data packets carried by said datacommunication signal.
 20. A method according to claim 19, wherein saidanalysis comprises identifying a presence or absence of repetitiveinformation in said at least one united signal, said signal indicativeof repetitive information comprising an indicator of said identifiedpresence or absence of repetitive information.
 21. A method according toclaim 19, wherein said analysis comprises extracting repetitiveinformation from said at least one united signal, wherein said signalindicative of repetitive information comprises said extracted repetitiveinformation.
 22. A method according to claim 19, further comprisingmonitoring said data communication signal between said first node andsaid second node.
 23. A method according to claim 19, further comprisingsampling a baseband input signal and providing said samples for saidcollecting.
 24. A method according to claim 19, further comprisingapplying frequency conversion to each one of said plurality of sequencesof samples prior to said combining said plurality of sequences ofsamples into said at least one united signal.
 25. A method according toclaim 19, wherein said combining comprises forming a weighted linearcombination of said plurality of sequences of said samples and delayedversions of said plurality of sequences of samples.
 26. A methodaccording to claim 25, further comprising selecting weightingcoefficients for said weighted linear combination in accordance withconditions of a communication channel of said network.
 27. A methodaccording to claim 19, wherein said combining comprises: specifying aplurality of sets of weighting coefficients; and forming a respectiveunited signal as a weighted linear combination of said plurality ofsequences of samples and delayed versions of said plurality of sequencesof samples for each one of said sets of weighting coefficients; saidsignal indicative of repetitive information being provided whenrepetitive information is identified in at least one of said respectiveunited signals.
 28. A non-transitory computer program product includingcomputer program code, which, when executed by a processor, causes theprocessor to detect repetitive information in data packets communicatedbetween a first node and a second node over a wireless network by:collecting samples of a data communication signal transmitted betweensaid first node and said second node over said wireless network at aplurality of respective times; grouping said collected samples into aplurality of sequences of samples; combining said plurality of sequencesof samples into at least one united signal; and based on an analysis ofsaid at least one united signal, providing a signal indicative ofrepetitive information in a plurality of data packets carried by saiddata communication signal.